A Property of Random Graphs
نویسندگان
چکیده
A graph G is said to have property P(k) if for any two sets A and B of vertices of G with A n B = $J and /A u BI = k , there is a vertex u P A u B which is joined to every vertex of A and not joined to any vertex of B . Note that if a graph G has property P(k) , then the complement GC of G also has property P(k) . If we specify the sizes of A and B as x and y respectively (x + y = k) then we denote the above property by P(k:x,y) I Let f(n) be the largest integer for which there exists a graph on n vertices having property P(f(n)) .
منابع مشابه
Regular pairs in sparse random graphs I
We consider bipartite subgraphs of sparse random graphs that are regular in the sense of Szemerédi and, among other things, show that they must satisfy a certain local pseudorandom property. This property and its consequences turn out to be useful when considering embedding problems in subgraphs of sparse random graphs.
متن کاملA weaker structural Markov property for decomposable graph laws
We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, prove the equivalence of an exponential family assumption, and discuss identifiability, modelling and computational implications. Some key words: conditional independence, graphical model, Markov random field, model determination, random graphs
متن کاملGraph properties, graph limits, and entropy
We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number, which by well-known results describes the rate of growth. We study also random graphs and their entropies. We show, for example, that if a hereditary property ha...
متن کاملQuasi-random graphs
We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class.
متن کاملErdös-Rényi Random Graphs: The Giant Component
Recall that all the “Real-World” graphs we examined in Lecture 2 had one component containing a large constant fraction of the vertices. The second-largest component was smaller by many orders of magnitude. This property is shared by Erdös-Rényi random graphs and by many other graph models. In this lecture, we will see (mostly) why Erdös-Rényi random graphs have this property. The large compone...
متن کاملGraphs with the N-e.c. Adjacency Property Constructed from Resolvable Designs
Random graphs with high probability satisfy the n-e.c. adjacency property, although until recently few explicit examples of such graphs were known. We supply a new general construction for generating infinite familes of finite regular n-e.c. graphs derived from certain resolvable Steiner 2-designs. We supply an extension of our construction to the infinite case, and thereby give a new represent...
متن کامل